An algebraic theory of interface automata
نویسندگان
چکیده
منابع مشابه
An algebraic theory of interface automata
We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating simulation defined on interface automata. Sinc...
متن کاملSix lectures on algebraic theory of automata
Introduction . 1 Lecture 1. Seraiautomata and Automata . , 3 Lecture 2. Coverings and Homomorphisms of Automata 8 Lecture 3. Covering by Direct and Cascade Products of Semiautomata 15 Lecture 4. Permutation and Reset Semiautomata 24 Lecture 5. The Structure Theorem of Krohn and Rhodes . . . .31 Lecture 6. The Necessity of Certain Components in a Cascade Product Covering of a Semiautomaton . . ....
متن کاملApplications of Algebraic Automata Theory to Quantum Finite Automata
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognitio...
متن کاملAlgebraic structures in automata and databases theory
Inevitably, reading is one of the requirements to be undergone. To improve the performance and quality, someone needs to have something new every day. It will suggest you to have more inspirations, then. However, the needs of inspirations will make you searching for some sources. Even from the other people experience, internet, and many books. Books and internet are the recommended media to hel...
متن کاملBridges between Algebraic Automata Theory and Complexity Theory
The algebraic theory of finite automata has been one of the most successful tools to study and classify regular languages. These very same tools can in fact be used to understand more powerful models of computation and we discuss here the impact that semigroup theory can have in computational complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.018